APRIORI-SD: ADAPTING ASSOCIATION RULE LEARNING TO SUBGROUP DISCOVERY
نویسندگان
چکیده
منابع مشابه
APRIORI-SD: Adapting Association Rule Learning to Subgroup Discovery
& This paper presents a subgroup discovery algorithm APRIORI-SD, developed by adapting association rule learning to subgroup discovery. The paper contributes to subgroup discovery, to a better understanding of the weighted covering algorithm, and the properties of the weighted relative accuracy heuristic by analyzing their performance in the ROC space. An experimental comparison with rule learn...
متن کاملRule induction for subgroup discovery with CN2-SD
Rule learning is typically used in solving classification and prediction tasks. However, learning of classification rules can be adapted also to subgroup discovery. This paper shows how this can be achieved by modifying the CN2 rule learning algorithm. Modifications include a new covering algorithm (weighted covering algorithm), a new search heuristic (weighted relative accuracy), probabilistic...
متن کاملSubgroup Discovery with CN2-SD
This paper investigates how to adapt standard classification rule learning approaches to subgroup discovery. The goal of subgroup discovery is to find rules describing subsets of the population that are sufficiently large and statistically unusual. The paper presents a subgroup discovery algorithm, CN2-SD, developed by modifying parts of the CN2 classification rule learner: its covering algorit...
متن کاملClassification Rule Learning with APRIORI-C
Mining of association rules became one of the strongest elds of data mining This paper presents a classi cation rule learning algo rithm APRIORI C upgrading APRIORI to dealing with classi cation problems decreasing its memory consumption and time complexity fur ther decreasing its time complexity by feature subset selection and im proving the understandability of results by rule post processing...
متن کاملSD-Map - A Fast Algorithm for Exhaustive Subgroup Discovery
In this paper we present the novel SD-Map algorithm for exhaustive but efficient subgroup discovery. SD-Map guarantees to identify all interesting subgroup patterns contained in a data set, in contrast to heuristic or samplingbased methods. The SD-Map algorithm utilizes the well-known FP-growth method for mining association rules with adaptations for the subgroup discovery task. We show how SD-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Artificial Intelligence
سال: 2006
ISSN: 0883-9514,1087-6545
DOI: 10.1080/08839510600779688